Investigating Emergence by Coarse Graining Elementary Cellular Automata
نویسندگان
چکیده
We extend coarse graining of cellular automata to investigate aspects of emergence. From the total coarse graining approach introduced by Israeli and Goldenfeld, Coarsegraining of cellular automata, emergence, and the predictability of complex systems, Phys. Rev. E, 2006, we devise partial coarse graining, and show qualitative differences in the results of total and partial coarse graining. Mutual information is used to show objectively how coarse grainings are related to the identification of emergent structure. We show that some valid coarse grainings have high mutual information, and are thus good at identifying and predicting emergent structures. We also show that the mapping from lower to emergent levels crucially affects the quality emergence.
منابع مشابه
Neutral Emergence and Coarse Graining
We introduce the concept of neutral emergence (defined by analogy to an information theoretic view of neutral evolution), and discuss how it might be used in the engineering of robust emergent systems. We describe preliminary results from an application to coarse graining of cellular automata.
متن کاملComplexity of Evolution Languages of the Elementary Cellular Automaton of Rule 146
Symbolic dynamics of cellular automata is introduced by coarse-graining the temporal evolution orbits. Evolution languages are defined. By using the theory of formal languages and automata, the complexity of evolution languages of the elementary cellular automaton of rule 146 is studied and it is proved that its width 1-evolution language is regular, but for every n ≥ 2 its width n-evolution la...
متن کاملAn Information-theoretic Classification of Complex Systems
Using elementary cellular automata as an example, a novel, information-based classification of complex systems is proposed that circumvents the problems associated with isolating the complexity generated as a product of an initial state from that which is intrinsic to a dynamical rule. Transfer entropy variations processed by the system for different initial states split the 256 elementary rule...
متن کاملWhen are cellular automata random ?
A cellular automaton is a collection of cells, each of which is in one of a finite number of states. The cells’ states are updated according to some local rules which take into account the state of the cell and the states of its neighbours. For instance: a two dimensional grid with two states per cell is used in Conway’s Game of Life in which each cell is alive or dead and transition rules are ...
متن کاملDetecting emergent processes in cellular automata with excess information
Many natural processes occur over characteristic spatial and temporal scales. This paper presents tools for (i) flexibly and scalably coarse-graining cellular automata and (ii) identifying which coarse-grainings express an automaton’s dynamics well, and which express its dynamics badly. We apply the tools to investigate a range of examples in Conway’s Game of Life and Hopfield networks and demo...
متن کامل